A guided walk Metropolis algorithm
نویسنده
چکیده
The random walk Metropolis algorithm is a simple Markov chain Monte Carlo scheme which is frequently used in Bayesian statistical problems. We propose a guided walk Metropolis algorithm which suppresses some of the random walk behavior in the Markov chain. This alternative algorithm is no harder to implement than the random walk Metropolis algorithm, but empirical studies show that it performs better in terms of eciency and convergence time.
منابع مشابه
A Topology-Aware Random Walk
When a graph can be decomposed into clusters of well connected subgraphs, it is possible to speed up random walks taking advantage of the topology of the graph. In this work, a new random walk scheme is introduced and a condition is given when the new random walk performs better than the Metropolis algorithm.
متن کاملThe random walk Metropolis: linking theory and practice through a case study
The random walk Metropolis: linking theory and practice through a case study. Summary: The random walk Metropolis (RWM) is one of the most common Markov Chain Monte Carlo algorithms in practical use today. Its theoretical properties have been extensively explored for certain classes of target, and a number of results with important practical implications have been derived. This article draws to...
متن کاملAdaptive Metropolis Sampling with Product Distributions
The Metropolis-Hastings (MH) algorithm is a way to sample a provided target distribution π(x). It works by repeatedly sampling a separate proposal distribution T (x, x) to generate a random walk {x(t)}. We consider a modification of the MH algorithm in which T is dynamically updated during the walk. The update at time t uses the {x(t < t)} to estimate the product distribution that has the least...
متن کاملOn the efficiency of pseudo-marginal random walk Metropolis algorithms
We examine the behaviour of the pseudo-marginal random walk Metropolis algorithm, where evaluations of the target density for the accept/reject probability are estimated rather than computed precisely. Under relatively general conditions on the target distribution, we obtain limiting formulae for the acceptance rate and for the expected squared jump distance, as the dimension of the target appr...
متن کاملA Simple and Robust Mutation Strategy for the Metropolis Light Transport Algorithm
This paper presents a new mutation strategy for the Metropolis light transport algorithm, which works in the unit cube of pseudo-random numbers instead of mutating in the path space. This transformation makes the integrand have lower variation and thus increases the acceptance probability of the mutated samples. Higher acceptance ratio, in turn, reduces the correlation of the samples, which inc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Statistics and Computing
دوره 8 شماره
صفحات -
تاریخ انتشار 1998